Non-uniformity and Quantum Advice in the Quantum Random Oracle Model

QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with preprocessing power, which receives a piece of bounded classical or advice. As are largely believed be the right model for attackers, starting from work Nayebi, Aaronson, Belovs, and Trevisan (QIC 2015), line works investigates security in model. Chung, Guo, Liu, Qian (FOCS 2020) provide framework establish many cryptographic applications. Although they achieve nearly optimal bounds applications advice, their advice far tight. In this work, we continue study on QROM. We new idea that generalizes previous multi-instance framework, believe is more quantum-friendly should analog games. To end, match those Chung al., showing almost as good/bad natural games Finally, show some contrived QROM, can exponentially better than parameter regimes. our best knowledge, provides an evidence general separation between relative unstructured oracle.